Black Boxes
نویسنده
چکیده
The non-structure theorems we have discussed in Chapter III rests usually on some freedom on finite sequences and on a kind of order. When our freedom is related to infinite sequences, and to trees, our work is sometimes harder. In particular, we may consider, for λ ≥ χ, χ regular, and φ = φ(x̄0, . . . , x̄α, . . .)α<χ in a vocabulary τ : (∗) For any I ⊆ λ we have a τ–modelMI and sequences āη (for η ∈ λ), where [η ⊳ ν ⇒ āη 6= āν ], lg(āη) = lg(x̄lg(η)), such that for η ∈ λ we have:
منابع مشابه
Logic Optimization of Designs Containing Black Boxes
We deene a notion of equivalence for designs containing black boxes. Using this notion, we describe a sound and complete methodology for optimizing designs containing black boxes, i.e. components whose functionality is not known; these arise naturally in the course of hierarchical design.
متن کاملVerifying Designs Containing Black Boxes
We deene a notion of equivalence for designs containing black boxes. This notion is applicable to both gate-level designs, as well as designs operating on integer variables. Using this notion, we describe a sound and complete methodology for optimizing designs containing black boxes, i.e. components whose functionality is not known; these arise naturally in the course of hierarchical design.
متن کاملRealisation of "Black Boxes" Using Machines
Modern engineering solutions attract attention of researchers to well-known problems in the field of system theory and cybernetics in general. The realisation problem of a “black box” is one among these problems. In this paper the non-anticipation property for a “black box” is generalised to the case of “black boxes”, whose behaviour admits deferred decisions. Furthermore, for such “black boxes...
متن کاملBasics of Intensionalized Data: Presets, Sets, and Nominats
In the paper we consider intensional aspects of the notion of data. We advocate an idea that traditional set-theoretic platform should be enhanced with new data structures having explicit intensional component. Among such data we distinguish the notions of preset and nominat. Intuitively, presets may be considered as collections of “black boxes”, nominats may be considered as collections of “gr...
متن کاملFlexible Modeling of Unknowns in Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design (i.e. a design containing so-called Black Boxes) can still be extended to a complete design satisfying a given property or whether the property is satisfied for all possible extensions. In this paper we extend a method based on a series of approximate, yet sound algorithms to prove or disprove CTL properties for incomplete designs...
متن کاملTesting Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but could be huge) set Bad. We introduce a novel approach to solve the problem that does not require integration testing. Instead, in our approach, the global testing problem is reduced to testing individual black-boxes in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008